About Selecting the Number of Processors for Parallel Multipopulation Genetic Algorithm

نویسندگان

چکیده

Introduction. The paper considers some features of the parallel implementation a multipopulation genetic algorithm, as well approaches to its optimization. results experiments with use different number processors and methods generating initial populations are presented in order optimize algorithm according several criteria (assessment computational time resources). On example specific test problem, estimates given for choosing optimal obtain desired result. purpose this work is conduct problem alternative population evaluate effectiveness algorithm. Results. For result 90–94 % optimum, most efficient terms computing resources 4 an uniform scanning space factor values. To achieve exceeding 94 by K1 (computational resources), 8 values showed best If we also take into account criterion K2, then 90–98 it necessary processors, 99–100 12 or 16 processes, depending on C1 C2 (cost respectively). Conclusions. Performed show that more than random method population. Experiments maximum efficiency PMGA, must be chosen precision. Keywords: generation, choice (populations),

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Experimental Study of Multipopulation Parallel Genetic Programming

The parallel execution of several populations in Evolutionary Algorithms has usually given good results. Nevertheless, researchers have to date drawn conflicting conclusions when using some of the Parallel Genetic Programming models. One aspect of the conflict is population size, since published GP works do not agree about whether to use large or small populations. This paper presents an experi...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

Parallel Genetic Algorithm Using Algorithmic Skeleton

Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...

متن کامل

Parallel Genetic Algorithm Using Algorithmic Skeleton

Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...

متن کامل

A multipopulation parallel genetic simulated annealing-based QoS routing and wavelength assignment integration algorithm for multicast in optical networks

In this paper, we propose an integrated Quality of Service (QoS) routing algorithm for optical networks. Given a QoSmulticast request and the delay interval specified by users, the proposed algorithm can find a flexible-QoS-based cost suboptimal routing tree. The algorithm first constructs the multicast tree based on the multipopulation parallel genetic simulated annealing algorithm, and then a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Kìbernetika ta komp'ûternì tehnologìï

سال: 2022

ISSN: ['2707-4501', '2707-451X']

DOI: https://doi.org/10.34229/2707-451x.22.2.3